Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
نویسندگان
چکیده
منابع مشابه
Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being ...
متن کاملSix New Constant Weight Binary Codes
We give six improved bounds on A(n, d, w), the maximum cardinality of a binary code of length n with minimum distance d and constant weight w.
متن کاملHeuristic Construction of Constant Weight Binary Codes
Constant weight binary codes are used in a number of applications. The most fully developed treatment of these codes in the literature is restricted to codes of length at most 28. Only recently have comprehensive results been presented for longer codes. Constructions based on mathematical structure are known for many of the shorter codes. However, such constructions are rarer for lengths greate...
متن کاملNew explicit binary constant weight codes from Reed-Solomon codes
Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from q-ary ReedSolomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant ...
متن کاملOptimal Constant Weight Codes
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2145490